// https://www.nowcoder.com/practice/99eb8040d116414ea3296467ce81cbbc?tpId=230&tqId=2023819&ru=/exam/oj&qru=/ta/dynamic-programming/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D196
// #include <iostream>
// #include <vector>
// using namespace std;

// int main() {
//     //1. 初始化
//     int n, m, q;
//     cin >> n >> m >> q;
//     vector<vector<int>> arr(n+1,vector<int>(m+1));
//     for (int i = 1; i <= n; i++) {
//         for (int j = 1; j <= m; j++) {
//             cin >> arr[i][j];
//         }
//     }
//     //2. 设置bq
//     vector<vector<long long>> bq(n+1,vector<long long>(m+1));
//     for (int i = 1; i <= n; i++) {
//         for (int j = 1; j <= m; j++) {
//             bq[i][j] = bq[i - 1][j] + bq[i][j - 1] + arr[i][j] - bq[i - 1][j - 1];
//         }
//     }
//      int x1, y1, x2, y2;
//     //3. 使用bq
//     while (q--) {
       
//         cin >> x1 >> y1 >> x2 >> y2;
//         cout<< bq[x2][y2] - bq[x1 - 1][y2] - bq[x2][y1 - 1] + bq[x1 - 1][y1 - 1]<<endl;



//     }



// }